Electronic five&#39;s multiple generator



Sept. 2, 1958 J. v. BLANKENBAKER ELECTRONIC FIVES MULTIPLE GENERATOR Filed Sept. 15, 1953 Amw- J/pw/u I I I I I I I I I I I N V EN TOR. 473/ kiu/z A i/vu/mz,

.Zza

miw

United States Patent ELECTRONIC FIVES MULTIPLE GENERATOR John Virgil Blankenbaker, Albany, 0reg., assignor, by mesne assignments, to Hughes Aircraft Company, a corporation of Delaware Application September 15, 1953, Serial No. 380,272

7 Claims. (Cl. 23561) This invention relates to electronic fives multiple generators and, more particularly, to a multiple generator for producing output signals corresponding to the product of fives times a binary-coded decimal input number represented by corresponding input signals.

The present invention provides a fives multiple generator which is particularly useful in a serial binary-coded decimal multiplier system of the type described in copending U. S. patent application Serial No. 381,181, for Serial Binary-Coded Decimal Multipliers, by John V. Blankenbaker, filed September 21, 1953. In the particular utilization of the fives multiple generator described The circuit economy achieved by the present invention is also due to an efficient utilization of binary digit storage devices, commonly referred to as flip-flops; multiple generators of the present invention the signal input functions are selected so that a minimum of flipflops are required for digit storage. In addition, by form ing each binary digit as a function of the previously formed digit it is possible to derive many of the binary digit signals necessary for forming the fives product from a series of shifting register stages which may also be utilized in other parts of the multiplication or division system. As a result of this efficient utilization of flip flops, a fives multiple generator according to the present invention may be introduced into a serial multiplication system with the additional requirement of only one or two flipdiops and 38 rectifier gating elements connected as two-level operators. tioned Harvard publication indicates that this provides a considerable improvement over a similar prior art circuit.

Accordingly it is an object of the present invention to provide a fives multiple generator wherein an ecoin this application, multiplication is performed by comj bining the partial products of l, 2, 4, and 5 times the multiplicand in a three-input adder circuit. As is fully explained in the copending application, the introduction of the fives multiple generator considerably simplifies the problem of combining the partial products since all complete product digit combinations may be obtained by adding one or two of the partial products.

The fives multiple generator of the present invention may also be utilized as a divide-by-two circuit wherein the fives multiples are effectively divided by ten with the introduction of a four binary digit shift. The divideby-two circuit is useful, by way of illustration, in a multiply-and-divide-by-two type of multiply unit such as is described on page 205 and pages 221 through 225 of Synthesis of Electronic Computing and Control Circuits by the Staff of the Computation Laboratory, published in 1951 by the Harvard University Press, Cambridge, Massachusetts.

Several forms of electronic Inultiply-by-five or divideby-two systems have been utilized in the computing art; illustrative prior art embodiments being described on pages 202 and 225 of the above-mentioned publication by the Harvard press. In general these circuits utilize vacuum tube or rectifier operators in a matrix conversion of the input signals to form the desired set of output signals. As will be better understood after the present invention is considered in detail, a conversion of input signals through a matrix requires a considerable number of gating elements and results in a large power dissipation,

relative to that required with the present invention.

The present invention provides a serially operable fives multiple generator wherein an economic utilization of gating circuit elements is achieved by forming each binary digit of the fives multiple or product as a funcv binary-coded decimal input numbers to produce the 'corresponding binary-coded decimal fives multiple or product output number, where each decimal digit of the input and output number is represented by four binary digits in the 84-2-1 code.

nomic utilization of gating circuit elements is achieved by forming each binary digit of the fives multiple as a function of the previously formed binary digit.

Another object of the invention is to provide an electronic fives multiple generator wherein a minimum of fliplops are required for digit storage; the efiicient utilization of flip-flops resulting from a novel definition of signal input functions.

A further object is to provide a serial fives multiple generator wherein the binary digit signals required for forming the fives multiple are derived from a series of sniffing stages, the generator requiring only one or two additional flip-flops.

Yet another object is to provide a fives multiple generator which may be introduced into a serial multithe invention are illustrated by way of examples. It is to be expressly understood, however, that the drawings are for the purpose of illustration and description only, and are not intended as a definition of the limits of the invention.

Fig. l is a schematic diagram of a fives multiple generator, according to the present invention, requiring only one flip-flop in addition to a five flip-flo shifting stage.

Fig. 2 is a schematic diagram of a fives multiple generator, according to the present invention, requiring two flip-flops in additionto a four flip flop shifting stage.

Reference isnow made t6 Fig. 1 wherein there is shown one form of fives multiple generator, according to the present invention, comprising a five,fliprfiop shiftingstage ltltl'in clu ding flip-flops Flt, F2, F3, F4, and F5; and a 209 including fa fiipflop F6, gating circuit 30R, and complement'er circuit The flip-flops in shifting stage ltiiineed not be con- I fives multiple digit storage stage C0. sidered as part of the fives multiple circuitryf since this stage may be part of the multiplicantl circulationpa th during multiplication, or utilized otherwise duringdivisionlj Gating circuit 191% is mechanized according to lo'gical Boolean equations which indicate the sequriceof'st'able states which flip-flop F6 is to assume during operation'ji Before the present invention may be fully understoodit is necessary toconsider the derivation o-f these'lo'gical' equations, and therefore the preliminary discussion which Patented Sept. 2, 19 5 8 Reference to the above-menand the fives multiple digits as Z j and k respectively indicating the binary and decimal digit positions. Thus the four binary digits of a decimal input digit 1: are represented bysthe notations W W 3, W 3, and W representing relative weights of 8, 4, 2, and 1,.respectively. Similarly the four binary digits of the corresponding fives multiple'or product number are represented by the notations Z 1Q, 2 and Z also representing relative weightsof 8; 4, 2,1and 1, respectively. The unit carry, the two-unit carry, and the four-unit carry are designated C C 3, and C respectively It will be noted that the letter Zris appropriately also utilized to represent the eights multiple digits in the above-mentioned copending application by R. R. Johnson since the eights and fives multiple generators are utilizedinterchangeably in different multiplication systems. i

In multiplying the decimal digit set W W 'W;,, and;W by five in the 8-4-2-1 code, the carries or left-hand digits C C 3, and Q} are formed, having the weights 4, 2, and 1 respectively, and are equal respectivelyto the digits W W and W Thus the multiplication-by-five of the binary digit groups 0000 respectively, are equal to thebin'ary digit signals W W and W respectively, in the next lower order binary digital place, and (2) the fives multiple digits Z Z 3, Z 3, and Z are equal to the binary sum of decimal 0 (0000 in the 8-42 l binary code) and the carry signals C 3, C 3, and C when the digit signal W is equal to 0, and the binary sum of decimal 5 (0101 in the 842-l code) and the carry signals C (3 and V A C when the input signalW has a 1 value' IuflTable, I, the furthest column on the left indicates the possible decimal value of the input digits W W W and W for two possible values'of W i. e. when W =0 and when W l. Thus when W =,0, the decimal value of the input digits may be 0, 2, 4, 6, or 8, and when W =l, the possible decimal value of the input digits is l, 3, 5, 7, or 9. Since there are ten useable 0110(6), 0111(7); and 1000 (s 1001 9 provide the carry signal groups 000; 001; 010; 011; and 100, respectively, where the decimal equivalent in the 842lt code of each binary digit group is indicated by a decimal digit'in parenthesisappearing immediately to the right of the group,; The complete times five digit Z is then obtaiued by adding, as binary numbers, the carries C to zero (0000 in the 8-4-2-1 code), if the digit group W represents an'even decimal digit; and the carries C as binary numberto five (010liin the 8-421 code) if the digit group W represents an odd decimal digit.

' Thus digit groups W g representing 0, 2,4,6, or 8, in the 8-;42l code Where W =0, provide digit groups Z equal to the carries C 3, and digit groups W representing 1,3,5, 7, M9 in the 84-2-1 code where W l,

provide digit groups Z equal to the carries C added to 0101'; It. is apparent, then, that to form the tiniesfive digitsjZ inthe 8421 code it is only necessary to specify the input digitsW and the carry representing digits W 'W and W respectively equal to the carries1C C Z'and C A complete truth table may 7 thus be provided'for' the fives multiplication operation in terms of. thisyariable as is indicated in'Table I below, where a binary l and a binary 0 are'represented in the table by a 1 and 0, respectively.

Table I combinations of the input digits W W W 3, and W in a binary-coded decimal system, and since, the least. significant binary digit W is equal to 0 for five of the combinations and is equal to 1 for the other five combinations, the second column from the left'in the table. lists five 0s and five ls for W The next three columns to the right in the table indicate all possiblecombinations of values for-the input signals W W and W in the preceding binary place; The possible combinations of signals W W and W are listed twice; once for the condition that W =0, and again 'for the condidition that'W =1. The next'four columns to the right list the values for the fives? multiple digits Z Z5, Z 3, and Z corresponding to the values for the signals W Ic1 ar and k1 carry signal designations C 8, C 3, and C appear above the signal designations W W,, and W respectively,-indicating their equality. The last column on the right hand edge of the table identify the rows or rules of the tablel,

Table I is of the input variables W W and W are first indicated in'an orderly fashion for W =0 and again for W =1. This is accomplished by assuming'the values of all Os for thefirst or uppermost row, designated rule 1. The second row fromthe top, rule 2,-is.then obtained by adding 1 in ajbinary fashionto signal] W repeated for each row until all five possibilities for W =0 are obtained, utilizing the principle that W;

is the least significant signal, W the neXt-to-the-least significant signal, and W the most significantsignalv The above process is then repeated for the lowestfive rows, 1. e.,, rules 6. to 10, of the table where W f=1fthus rules 1 10,5, thenvalues for Z 2 and 2 are filled in as equal to'the corresponding values'for W,, Wi

and W firespectively, and column Z f is completed with Binary carry di its on on 0p Flves multiple digits Rule Binary input digits--- W -r W5- W5 Z Zn Decimal values:

HHHHHOOOOO HDOOOHOQOO or-noocn-nco OHOHOQi-l-O n-u-uboocooos OOHHHHOOFDO Table I is derived on the basis of the 'abovediscussed general principles; i; e. (1) the carry signals C Q3, and

C representing four-unit, two-unit, and one-unit carries,-

all {For those rows where'Wj =l, i. e., rules 5 to 10, columns Z 2& Z andjZ are completed by entering for each 1 row thebinary sum of: decimal 5, expressed bi It should be noted that the derived as follows: All possible combinations This is" narily as 0101 in the 84 2-1 code,and the correspond tion of circuits employing and" and or circuits or gates which correspond directly to the logical equations. Such circuits are well known in the art, typical circuits being described in detail in U. S. Patent No. 2,644,887, filed December 18, 1950, entitled Synchronizing Generator by A. E. Wolfe, Jr. Regardless of structural variations,

the functional characteristics of these logical circuits re main substantially constant in the art, i. e., a I logical and circuit produces an output signal only when signals are simultaneously applied to all the inputs, and a logical or circuit produces an output signal when a signal is applied to at least one of its inputs.

The manner in which a logical expression for z may be derived from Table I will now be explained in detail. From Table I, it is seen that Z has a 1 value on rows or rules 2, 4, 6, 8, and 10, and a 0 value for rules 1, 3, 5, 7, and 9. Considering first rules 2 and 4, i. e., when V =0, Z =l only when W Thus the logical expression Z :i4 .C defines signal Z;' for rules 2 and 4 of the table, where the dot (1) represents the logical and proposition. Considering next the rules'wherein W =l, it is noted from the table that Z =1 only when W =0, i. e., rules 6, 8, and 10. Thus rules 6 8, and 10 are satisfied by the logical expression By logically adding the above two expressions for Z a combined function expressing all conditions where Z l, i. e., rules 2, 4, 6, 8, and 10, may be written as 2:: Wi. t-l Wit Val Wi0i+ Wm:

where the dot and the plus represent the logical and and or functions, respectively, the bar over the symbol of a signal indicates the complement of the signal, and where C is substituted for W in the second expression above. According to this function, then, the digit Z is equal to 1 if either digits W and W are respectively 0 and 1, or if these digits are respectively 1 and 0.

In precisely the same manner as utilized for deriving the above expression for Z}, the other fives multiple digits Z Z 3, and Z may be found to be representable by the functions:

It is possible to mech'anize a fives multiple generator directly as a function of the input signals representing the digits Nias indicated by the above functions. 'This may be done in the manner fully explained in the above-mentioned copending application for Electronic Multiple Product Generators; the general technique being to formulate all of the desired product digits simultaneously and to shift them forward through the product generator flip-flops. While this procedure provides a very satisfactory circuit for generating products which are successive powers of two as in the copending application, it results in an inefficient utilization of flip-flops and gating circuit elements where only a single product is to be generated. This is especially true where it is necessary to utilize the input signals again in later operations as in the successive cycles of operations in multiplication by multidigit multipliers. It becomes very important in many applications, therefore, that the flip-flops providing the input signals operate only to shift the input signals so that they may be utilized for later operations.

According to the present invention, the basic defining equations for Z 2 and Z are rewritten as functions of Z Z and Z respectively so that these digits may be successively formed in time through a single product digit generating flip-flop. This technique makes it possible to utilize all flip-flops providing the input signals in a shifting stage which, for example, may be part of the multiplicand register circulation path. As a result, it can also be established, that the total number of gating circut elements required is considerably reduced over the number required to simultaneously generate all digits and shift them forward in a shifting and correcting register. The functions for 2,5, 2,5, and Z 5 may then be redefined as follows:

The above expressions are derived directly from Table I in a manner similar to that previously described. For example, in deriving the expression for 2,}, it is noted in Table I that 2;; has a value of l for rules 3, 4, 7, and 8, and has a 0 value for all other rules. Considering first rules 3 and 4, i. e., when W =0, it is seen that only on rules 3 and 4 is W =0 and C 3 (or its equivalent W equal to 1. Thus rules 3 and 4 may be distinguished by the logical expression Z .C When W =l, C 3 and Z are both 0 level signals on rule 7, and are both 1 level signals on rule 8. Thus rules 7 and 8 may be distinguished by the expression are derived in precisely the same manner as above described and further explanation of the derivation of these expressions is' deemed unnecessary."

One form of-mechanization according to the rewritten equations'a-bove is illustratedin" Fig. 1 wherein five 111pfiops F1, F2, F3, F4, andVFS are included in shifting stage 100'producing Corresponding -complementary sig- Table III) is divided into three major sections; section (a) indicating the binary digits stored in the shifting vals T to T section (b) indicating the data stored in 11a1s 1 F1; 2 F2; 3 is; :4 31; and p5 '53 An cup 5 the output hip-flop F6 during these time intervals; and put flip-flop F6, producing signals F and F is included Sectloh l h g th Input slgnal requirements of in the fives multiple digit producing stage 2% and has g pg I11 the table, th tlmetlnterialsr input circuits 1F6 and ,0F6 such that pulses applied sep- T g g i T mdlcagd zg i arately to input circuits 1P6 and @F6 set flip-flop F6 to of e co umn g e e if i ta stable states representing binary 1 and 0 respectively, and g fi to 9 %9 592 0 w f (a) g. the simultaneous application of pulses to both input cir- 2 t G L E' e S i s g i g cuits 1P6 and 0P6 triggers flip-flop F6 or causes it to on t 6 row 0m 6 Op 0 e a e as i i assume a complementary Stable Stata 1nd1cated. The row or rule numbers of the lower ten The operation of shiftin sta too i such t the rows of the table are indicated in the furthermost column digit w is registered in iii -fici s F1,-F2, F3; and-Fe 15 "P the left. the tablez Section 9 .1i.Sting.the input respectively during the' first, second, third, and fourth slglial reqlilrements of f gf q Into t digit time intervals-of operation represented respectively male}- Secnons fi :Sectlon mdlcatmg e mpllt i by signals T T T T In a similar fashion it is apireqiurememi for i mterv a Second q parent that the digits W 1 W 2 Wfi and W 4 appear catmg the Input slgpal .reqimqmeltts for Inter}, a1 e in fli F1 i g interval}; T1 T2 20 T and a third sect on indlcatlng input signal require- T4 rgspegfively r g a ments for time interval T Each of these time interval 7 requirements are further divided into a true or 1 input gggpz gf g 5 :2? $5 13; 2 :3 fgg gg g fi iii requirement and a false or 0 input requirement desiga s a a 7 o cistered in the output flip-flop F for each of the time Hated and respectlvely at head of the terval T t T inclusive are illustrated in Table Ila appropnate columns' S O V r Rows or rules 1 to 10 of section (a) of Table IIb r 7 T bl H above indicate all possible combinations of input signals a e a W W W nf", and W and rules 1 to 10 of section section (b) indicate the corresponding values of the fives Section (a) multiple output digits Z 2 3, L8, and Z Shifting stage OPtPut Since rows 1 to 10 of sections (a) and (b) of'Table T t 1 n -r1 imam 5 1p Op IIb are duphcations of rules 1 to 10 of Table I above, a no further explanation of the derivation of this portion of the table is considered necessary. 1

a .The upper portions (the uppermost four rows) of W 4 WJ W W 2- V il Will wits Wi -i Z'l sections (a) and (b) of the Table IIb are denved from 22?;1 Table IIa above. Each column lists the flip-flop in which 7 the corresponding binary digit of the column is stored Table 11a is divided into two sections, section (a) defor the tlme Intervals T1 to T*- h hqtthg the furthest fining the binary input digits registered in the ,shifting 40 h leftpf'thtt table, dul'lng tlhtevpTl the pu stage flip-flops F to F for each time interval T to T 'y glt W 3 is stored 111 the 'F1 fl1p- OP during and Section (b) defining the fives multiple binary digits t T2, 11 13 Stored 111 P- P S h dllflflg time. registered in the output'flip-fiop F for the time intervals Intervals and Wk 1S t' P' PP F3 and T to T The time intervals T 'to T are indicatedron respecttve1ystmllatly the dlglts Wan, V the extreme left-hand column of the table. W 7 4 1 1 1? and Z t are stored in the The timing of the operation of the embodiment of V ?P hsted t h thQ correspohdmg columntat the Fig. 1 and the binary input signals required for the various tlme'mtervals as lPdlcatefi at t the table; For 7 input circuits,rare shown in Table 1117 appearing below. 1 example the s P t R Pe Z1: 15 f f 111 Table III) is formed by combining Tables I and Table Ila Output fllpflop F6 durmg tune 1hte1'Va1 T3 as lndlcated y 'above. Thus, Table 1112 comprises a lower section essenreference to the second from the flight of Section tially reproducing Table I and an upper section indicating, 0 the table- I a in a slightly altered fashion, the information illustrated As willbe more fully explained lat r the y h in Table IIa above a a I 1F6 and 0P6 appearing at the heads of the columns ot Table Ilb Section (11) Section (b) Section (c) Shifting stage flip-flops Output flip-flop V V Flip-flop F6 input signal requirements, Time Intervals: V

T4 F4 J F5 F6 1 T F3 F4 F5 F6 '1 F2 F3 7 "F4 F5 F6 7 T F1 F2 F3 F4 For time T For time '1 For time T4 Binary digits- 'Wu Wit-1 Wk-1 WH 21, Zn Zk Zk 1E6 0F6 136 01516 1E6 .OFG

Rule numbers! 7 V V r 0 1 0 1 W1 0 0 1 1 "if III: "0 1/ 0 0 0 1 0 0 i 8 B i 8 i i it 1 1 o 1 i 0 0 V 1 1, 1 0 1 0 1 1 1 0 0 a 0 0 r V -1 1-11 1.0 0 1 0 0 a 1 1 0 section of the table identify the input requirements of the fiip-fiop F6. Briefly stated at present 1P6 and 0F6 indicate input requirements of the 1 and 0 input circuits, respectively, of flip-flops F6. A 1 in a column indicates that a triggering or clock pulse must be applied to the corresponding input, and a 0 in a column indicates that a triggering pulse must not be applied to the input. A blank (neither a 1 or a 0) indicates that a triggering pulse is not necessary but is permissible at the corresponding input.

By a comparison of the previous state of flip-flop F6 with the desired present state of the flip-flop, the values for 1P6 and 0P6 may be readily ascertained. For example, in deriving the input signal requirements for flipthe uppermost row, in section (a) of Table 110. Simi larly, during T time, flip-flops F2, F3, and F4 register the same binary values on rows 3 and 4, rows 6 and 7, and rows 8 and 9 of Table Hb and may therefore be combined to form the second, fourth, and fifth rows from the top, respectively, of section (a) of Table IIc. By a process essentially identical to that explained above for the derivation of section (a) of Table 110, sections (In) and (c) of the table are completed.

Before considering the logical equations defining gating circuit 101 6 controlling flip-flop F6 it is important to understand the various types of mechanizations which may be utilized. According to one type of equation, the sequence of stable states of the flip-flop are directly deflop F6 during time T reference i made t th f th t l fined so that the value of the equation at a particular column to the right of section (b) of the table to ascertime indicates the next pp settihg- This p of tain the present state (at T time) of the fli -flo Th function may be referred to as a setting function and next succeeding or desired future state of flip-flop F6 is requires Ineahs to set the eohtfoiied pp to 0 when then determined by reference to the second column to the the Controlling gating Circuit Produces, a o'repfesehtiilg left of section (b) of the table, i. e., the column indicat- 29 g This Operation is effected, in the embodiment ing the data stored in flip-flop F6 during T time. Thus (if gy eompieihehtei' C0 in gating Circuit considering rule 1 of the table, it is noted that flip-flop Complementer cireilit C0 Provides separate signals for F6 stores a binary 0 during T time and again a binary the 1 and 0 input circuits of ipp F6 When the 0 during T time. Therefore since flip-flop F6 is in P signal Produced y gating Circuit 161:6 has 1 and 0 the 0 state during time T and time T th i no d representing levels respectively. It is also possible to to trigger the fiip-fiop. A signal to the 1 input of the achieve the setting operation y utilizing an flip-flop, however, must be inhibited, thus, a 0 is entered g pp Which is Continuously set to 0 When the in row 1 of the 1P6 olum fo ti T N t noting input gating signal is 0 by pulses applied to its 0 input rule 2 of the table for the m tim i t l i i circuit and is set to 1 when the gating circuit signal is noted that flip-flop F6 stores a binary 1 during ti T 30 1 because the 1 input signal overides the simultaneously and stores a binary 0 during time T Thus, flip-flop F6 Rp 0 input sighaimust be triggered from the 1 state to the 0 state at the According to a second yp of equation, the Conditions end of time interval T This is indicated in the table for changing the pp Stable state or triggering the by placing a 1 in column 0F6 on the corresponding row pp are estahiished- When a Changing function is of the table for time T It is noted, therefore, that utilized, a conventional pp is p y and the the manner of completing section (0) of Table IIb ting Circuit signal is pp to both 1 and 0 input above is a straightforward procedure directly derivable Cilits 0f the ppfrom the data of section (b) of the table. In precisely II1 y situations, it is desirable to separate the changa similar manner as above described section (0) of the ihg p of equation into tWO Partial-Changing fililetiOIls table is completed, further explanation of the derivation 40 Which separately define the Conditions for Changing the of each of the 1s and 0s in this section of the table associated P P stable state item 0 t0 and from 1 being on id ed superfluous, to O. The partial-changing functions are particularly use- The input requirements for flip-flop F6 indi t d i ful Where the equations include the output signals of the section (0) of Table 1111 above are indicated in Table pp to he cohtroiied- In this Case the partiai'chahg- IIc below in terms of the bistable states or binary digits g functions y he siIhPiitied according to rules Which stored in the shifting register flip-flops F2, F3, and F4. are briefly considered below and fully described in the Table IIc Section (a) Section (11) Section (c) Rule T =1 Rule T3=1 Rule T4=1 F2 F3 F4 1F6 OFG F3 F4 F5 lFG OFG F4 1E6 OFB Table IIc above is divided into three sections, section (a) for time interval T section (b) for time interval T and section (0) for time interval T Each of the above sections includes, in addition to columns F2, F3, F4, 1P6, and 0P6, a column listing the corresponding rows or rule numbers of Table IIb.

Table He is derived directly from Table Hb by combining the rows of Table III) wherein the data stored in flip-flops F2, F3, and F4 are the same for a given time interval. Thus in Table II!) it is noted that flip-flops F2, F3, and F4 each store a binary 0 during time T for rules 1 and 2. Therefore rules 1 and 2 for time T of Table IIb are combined to form a single row, i.'e.,

notation: ToFj=; 1Fj=OFj and separate r 1.1. senting and flip-flop) are designated respectively by the functions 1Fj= and Fj=, respective1y. a

As is more'fully explained in the above-mentioned references (1) and (2), any flip-flop function may be written in the form: V

' i roF =F .G+Fj'fi T which may be reduced to thesimplified partial-changing functions: a V

V -1Fj G A V 0Fj=H r H i G and H being any functions of'variables other than F and'F where F and F are the signals produced by flip-flop F I n V The flip-flop stable state transformation may also be represented by the function: 1

7 V F'=F.G+-F.E where F repres'ents the new flip-flop signal and the l and 0 input functions are 1F=G. v OF=H Tablelll G H F F In many situations, as in the case crime present inven- Whileit is apparent that several mechanization forms rnay be utilized to define gating circuit -10F6, showri in Fig. 1, as an illustration gating circuit 10F6 is mech- Analysis' of the transformation function indicates that anized according to the following function:

tarySignal'Generating Networks byD. L. Curtis, filed. 7

September 5, 1952, now Patent'No. 2,812,451, andfas-' signed to the same assignee as the present application. 'Each fand, function in'the definingfunction above is provided by an and circuit which responds to the signals indicated by the corresponding functionand produces a l-representing output'signalwhen all applied 1 input-signalsare l-representing signals.- Thus, the fand functions T .F .F ,'T '.Fl..F and. T .F .F areprovided tion, it is necessary to formulate the unknown input functions G and H where the desired transformation F to F is known. In this case the corollary of the above stated proposition is utilized, namely that when F is originally 0 the function G is equal to F, and when F c is originally 1, the function H is equal to F or'H is the corollary conby and circuits 10F6-1, 10F62, and 10F6-3, respond to separate input terminals, for producing l-representing output signals whenall applied signals are l-representing signals The arid functions are combined in or circuiti10F64' which produces ail-representing output signal when any one or more. of the input and functions is 1.

. -And and or circuits areqnow well-known" in the computer art and therefore it is not deemed necessary to consider such circuits in detail in this application. Ex-

amples of such circuits are shown on pages 37 to 45 of during the digit time interval represented by signalQ'I During this time interval the variable Z is to be formed and entered into flip-flop F6 where previouslythe digit is to be representative of the digit Z According to the above discussed rule, then, the. input function for input circuit 1F6, or the function G, is equal to the variable mgh-Speed ComputingDeviccsl by Engineering Re:

digital computers by Tung Chang Chen, in volume 38 ing to signals T F F T F 'F and T ,F F applied 1 of Proceedings ofthe Institute of: Radio Engineers'-on by the Os for the variable Z Thus, opposite to each-'0 for the variable Z kthe digitappearing-in thjeiFG function is equal to the digit Z In a similar'manner,

Z is 1, the input function 0F6' has, a value comple- IY' i "Q 'YQh B-QLZ Z;If?. 11;:1 gt:

,. tively. dividedby ten' (providing .5

The operation of the embodiment o'f lisrillustrated in TableIV, below, wherein the input'number 967 (1001 .0110 0111) is multiplied by 5 to provide the 7 product 4835 (0100 1000 001 l' 0101).: indicated 0 Table IV the least'significant binary digit of the. product-Y; 7,

appears in flip-flop F6 at the time signal T is equal to 11 If it is desired to' operate the embodiment of Fig. 1 as a divide-bytwo circuit; the 'signals produced by flip-flop" time so that thefirst decimal digit 5 r ea d out isreffecf,

' F6 are": consideredasbeifig shiftedfour binary digits in' j As indicated in the above considered functions for digits Z and 2 3, several forms of mechanization are possible. In another embodiment of the present invention illustrated in Fig. 2 the digit L3 is produced as a function of both the digits Z and Z as defined in the function:

Z: W1. *H+ Mi amaze In the embodiment of Fig. 2 only four flip-flops are included in shifting stage 100, namely, flip-flops F1, F2, F3, and F4 producing signals indicated above with regard to the embodiment of Fig. 1. On the other hand the fives multiple digit storage stage 200 includes two flip-flops F5 and F6 which are required in order to provide signals indicating'the digits Z and Z during the formation of the digit Z The five multiple digits as formed are entered into flip-flop F5 through controlling gating circuit 20F5. It will be noted that no complementer circuit is utilized since separate input signals are applied to the 1 and 0 input circuits of flip-flop F5. The mechanization functions defining circuit 20F5 are obtained from Table Va is similar in construction to Table Hb above in that the table is divided into a section (a) defining the binary digits stored in the shifting stage flip-flops F1, F2, F3, and F4; a section (b) defining the data stored in the output flip-flops F5 and F6; and a section (c) indicating the input requirements of flip-flop F5. The lower portion of sections (a) and (b) of the table is a reproduction of Table I above. Table Vb is derived from Table Va in a manner similar to that utilized in deriving Table IIc from Table IIb above. Similarly, techniques for deriving the flip-flop functions from a table defining the flip-flop input requirements having been fully discussed in relation to Table 110' above, 110 further explana tion of the methods of deriving the following flip-flop functions for flip-flop F5 is considered necessary.

toF5=Zi= T F .F +F .F T .(1 .F +F .F .i

F4175) T3.I73.F4+F3.FT4.(F5+ F) T4.F4.F5

1F5= T1.(F1.F4+ F1154) +T F' .F +F .F'

T3.(173.F4+F3.F4.F) Tu 0F5= T F .F F111) TEE-4+ T fi T4 The embodiment of Fig. 2 illustrates the mechanization of a gating circuit providing separate input signals for the l and 0 input circuits of a flip-flop (flip flop F5). The mechanization functions utilized are:

Where again the clock pulse signal is introduced as a synchronizing and condition. The mechanization of Tables'Va and Vb below. 40 the embodiment of Fig. 2 in accordance with these equa- Table Va Section ((1) Section (D) Shifting stage flip-flops Output flip-flops Section (c) Flip-flop F5 input signal requirements Time interval:

For time T For time T For time T Binary digits .1 W1. WM W1-1 WM Z3 Z1 Zn Z11 1F5 0F5 1F5 OFS 1F5 0F5 Rule number:

1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 0 0 1 0 0 0 1 0 0 0 1 1 O 0 1 1 0 1 0 0 0 1 0 0 1 0 0 0 0 1 0 1 1 0 0 1 0 1 1 0 1 0 1 0 0 1 l 1 1 0 1 1 1 0 0 O 1 1 0 0 1 0 0 1 Table Vb V T 1 T =1 'I1 Rule Rule Rule F2 F3 F4 1F5 0P5 F3 F4 F6 1E5 0F5 F4 1E5 0E5 tions should be apparent from the examples considered above.

. 7 From the foregoing description it should now be ap parent that the present invention provides an'electronic fives multiple generator wherein an'economical utilization of gating circuit elements is achieved by forming each binary digit as a function of the previously formed binary digit. it has been specifically'pointed out that, according to the present invention, the fives multiple may be formed in a serial operation wherein the input signals are derived from a seriescof' shifting stages and the generator itself requires only one or two additional flip-flops. It is thus apparent that the fives multiple generator may be readily introduced into a serial multi-' plication system with a minimum requirementof addi-' tional flip-flops and gating circuit elements.

While the invention has been described in detail in regard to a few specific embodiments it should be understood that many other-variations are possible. For example, the flip-flop setting, changing, and partialchanging functions may be used'interchangeably to provide a great variety of gating circuits. In addition, gating circuits may be re-a'rranged to provide different forms corresponding to various factored forms of defining equa tions. I

Therefore, it will be readily appreciated that the present invention is not specifically limited to the embodiments discussed, but is generic to a general class of five multiple generators as defined in the following claims.

What is claimed as new is:

shift register capable of providing output signals representative of a binary-decimal coded number registered therein, means for serially'delivering binary-decimal coded signals representative of a number'to be multiplied to said shift register, an output storage device capable of providing an output signal representative of the storage state thereof, a plurality of logical gating circuits interconnecting said shift register and said output device to control the storage state of the latter whereby the output signals thereof represent thefives multiple of the number delivered to said shift register, and means for cyclically providing individual timing signals and serially delivering same to said gating'circuits in a predeterminedfime'relationship with the delivery of the signals to said shift register, each of said gating circuits being responsive to e the individual timing signalsin combination with prede termined signals from said shift register'or said output storage device. V A. 7

'2. An electronic multiple generator comprising a shift register including a plurality of bistable. storage devices,

each of said devices being capable of providing-comple-' mentary output signals representative of the storagecondition thereof and thereby the binary-decimal number registered therein, means for serially'delivering electrical signals representative of a number to be multiplied to said shift register; an output bistable storage device capable of providing complementary output signals representative of the storage state thereof, a plurality of logical gating circuits interconnecting said shift register and said output device to control the storage state of the latter whereby sentative of a binary-decimal coded numberregister'ed '1. An electronic fives-multiple generator comprising a 4. An electronic fives multiplegenerator comprising at least four serially connected bistable storage devices, each 'of said cdevicesbeing characterized as providing output signals representative of the storage condition thereof, means for serially delivering binary-decimal coded electrical signals representative of a number to be'rnultiplied, the least significant digit first, to said devices; an output bistable storage device providing output signals representative of the storage state theerof, 'at least four logical gating circuits interconnecting said four serially connected devices and said output device to control the storage state of the latter whereby the binary-decimal out put signals thereof represent the fives multiple of the number delivered to said shift register, and means for cyclically providing a plurality ,of timing signals and serially delivering the signals to. saidgating circuits in a predetermined time relationship with the delivery of the signals to said shift register, each of said gating circuits being responsive to a different one of said timing signals.

in combination with predetermined signals from said serially connected devices and said output storage device.

5. An electronic fives multiple generator as defined in. 4 claim 4 including an additional bistable storage. device connected with saidcgating circuits to control the storage state of said output device. V 7

r 6. An electronic fives multiple generator comprising a. shift register capable of providing output'signalsrepre therein, means for serially delivering a binary-decimal coded signal representative of a number to be multiplied to said shift register, an output storage device capable ing signals to said gating circuits in a predetermined'time relationship with the delivery of the signals to said shift.

register, each of said gating circuits being responsive to the individual timing signals in combination with preidetermined signals from said shift register or said out- ,Put storage device 7 r. .7 r a.

7. An electronic fives multiple generator comprising .;a shift register including acplurality of bistablefstorage devices, each of said devices being characterized'asc'pro -a .viding complernentary staticoutput signalsrepresentative,

of the binary decimal coded number registered in the- I shift register, 'means for serially delivering binary.deci ;j

mal coded signals representative of a number to be mul--' tiplied, the leastsignificant digit first, to said shift; regis: ter; anoutput bistable storage device capableof provid'-;: ing complementary staticoutput signals representative of:

the storage state thereof, a plurality of logical gating cir;

cuits connected to receive the output signals from said the output signals thereof represent a multiple of the number delivered to said shift'register, and means for cyclically providing individual timing signals and serially' delivering the signals to said gating circuits in a predetermined time relationship with the delivery of the signals to said shift register, each of said gating circuits being responsive to the individualtiming signalsin .combina-" .tion with predetermined signals from said shift-register or said 'output storage device.

3. An electronic multiple generator as defined in claim 2 wherein .each'of said bistable storage devices ,provide staticcomplementary output signalsia nd 'said gatingfcir-f cuits include a plurality of logical and circuits and at least a single logical or Circuit. 7, T a

shiftregister and from said output device for logically combining said signals and producing an output signal in response thereto, at least a single logical or circuit connected to each of said gating circuits and to saidoutputput device for controlling the storage state of the latter whereby the output signals thereof represent the fives multiple of the signals, delivered to said shift reg- 'ister, and means for cyclically providing individual tim- 7 .ing signals serially delivered to said gating circnitsin a predetermined time relationship with the delivery o f-the. signals to said'shift register, each of said gating. circuits being responsive to a different one of said timing signals in combination with predetermined, signals from' said shift register or said output storage device. p j.

(References on following page) 5 18 References Cited in the file of this patent OTHER REFERENCES UNITED STATES PATENTS Synthesis of Electronic Computing and Control Cir- 2 594 731 C 11 A 29 1952 cults, Harvard University, 1951, pages 218-220. 2 6341052 211 1 7 1953 Algebraic Theory For Use In Digital Computer De- 2:644387 Wolfe July 1953 5 sign, Nelson, IRE Transactions, Electronic Computers, 2,685,407 Robinson Aug, 3, 1954 September 1954, Pages 2,711,526 Gloess June 21, 1955 FOREIGN PATENTS 1,035,453 France Apr. 15, 1953 10 UNITED STATES PATENT OFFICE Certificate of Correction Patent No. 2,850,233 September 2, 1958 John Virgil Blankenbaker It is hereby certified that error appears in the printed specification of the above numbered patent requiring correction and that the said Letters Patent should read as corrected below.

Throughout the description, Wherever it appears,

W should be W Z should be -Z, W 2 should be W,l; Z should be Z-; W 3 should be Wi; Z f should be 'Z, W 3 should be Wi; Z 5 should be -Zfi-; ,5" should be W,: 29" should be Z; W should be Wfi Z should be Z W should be Wi Z should be Zfi W should be W C should be Cfi; W should be W C should be -C-; W 3 should be Wl 05" should be c W should be v'v 1; cg should be -o Z 9 should be Z 6; should be 412-;

Signed and sealed this 2nd day of December 1958.

Attest KARL H. AXLINE, ROBERT C. WATSON,

Attestz'ng Ofiioer. i flommz'ssz'oner of Patents. 

